Diagonal and Monomial Solutions of the Matrix Equation AXB=C

نویسنده

چکیده مقاله:

In this article, we consider the matrix equation $AXB=C$, where A, B, C are given matrices and give new necessary and sufficient conditions for the existence of the diagonal solutions and monomial solutions to this equation. We also present a general form of such solutions. Moreover, we consider the least squares problem $min_X |C-AXB |_F$ where $X$ is a diagonal or monomial matrix. The explicit expressions of the optimal solution and the minimum norm solution are both provided.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative solutions to the linear matrix equation

In this paper the gradient based iterative algorithm is presented to solve the linear matrix equation AXB +CXD = E, where X is unknown matrix, A,B,C,D,E are the given constant matrices. It is proved that if the equation has a solution, then the unique minimum norm solution can be obtained by choosing a special kind of initial matrices. Two numerical examples show that the introduced iterative a...

متن کامل

The Symmetric and Antipersymmetric Solutions of the Matrix Equation

A matrix A = (aij) ∈ Rn×n is said to be symmetric and antipersymmetric matrix if aij = aji = −an−j+1,n−i+1 for all 1 ≤ i, j ≤ n. Peng gave the bisymmetric solutions of the matrix equation A1X1B1+A2X2B2+. . .+AlXlBl = C, where [X1, X2, . . . , Xl] is a real matrices group. Based on this work, an adjusted iterative method is proposed to find the symmetric and antipersymmetric solutions of the abo...

متن کامل

Analytic properties of matrix Riccati equation solutions

For matrix Riccati equations of platoontype systems and of systems arising from PDEs, assuming the coefficients are analytic functions in a suitable domain, the analyticity of the stabilizing solution is proved under various hypotheses. In addition, general results on the analytic behavior of stabilizing solutions are developed. I. NONSTANDARD RICCATI EQUATIONS In [10], [7] and elsewhere contin...

متن کامل

Diagonal Matrix Reduction over Refinement Rings

  Abstract: A ring R is called a refinement ring if the monoid of finitely generated projective R- modules is refinement.  Let R be a commutative refinement ring and M, N, be two finitely generated projective R-nodules, then M~N  if and only if Mm ~Nm for all maximal ideal m of  R. A rectangular matrix A over R admits diagonal reduction if there exit invertible matrices p and Q such that PAQ is...

متن کامل

determinant of the hankel matrix with binomial entries

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

15 صفحه اول

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 9  شماره None

صفحات  31- 42

تاریخ انتشار 2014-05

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

کلمات کلیدی

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023